Project management for arbitrary random durations and cost attributes by applying network approaches

نویسنده

  • Yi-Kuei Lin
چکیده

This paper concentrates on the quality management of a project by applying network approaches and statistics methods. A large-scale project can be modeled as a project network. This paper tries to schedule the duration of the project by applying the approaches in network analysis in case the activity duration and the corresponding cost are both arbitrary random variables with a probability distribution. Subject to the project time (the deadline to complete the project) constraint and the budget constraint, this paper studies how to schedule all activity durations of the project. Two algorithms are proposed to generate all upper and lower duration vectors for the project. All feasible activity durations are among such upper and lower duration vectors. Whenever any constraint is changed during the project period, we can re-schedule the activity durations efficiently by applying the proposed algorithm. Furthermore, we can evaluate the probability that the project will be executed successfully, subject to the time and budget constraints. Such a probability is an index for measuring the quality and feasibility of the project. © 2008 Elsevier Ltd. All rights reserved.

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Evaluating project’s completion time with Q-learning

Nowadays project management is a key component in introductory operations management. The educators and the researchers in these areas advocate representing a project as a network and applying the solution approaches for network models to them to assist project managers to monitor their completion. In this paper, we evaluated project’s completion time utilizing the Q-learning algorithm. So the ...

متن کامل

Evaluating project’s completion time with Q-learning

Nowadays project management is a key component in introductory operations management. The educators and the researchers in these areas advocate representing a project as a network and applying the solution approaches for network models to them to assist project managers to monitor their completion. In this paper, we evaluated project’s completion time utilizing the Q-learning algorithm. So the ...

متن کامل

Expected Duration of Dynamic Markov PERT Networks

Abstract : In this paper , we apply the stochastic dynamic programming to approximate the mean project completion time in dynamic Markov PERT networks. It is assumed that the activity durations are independent random variables with exponential distributions, but some social and economical problems influence the mean of activity durations. It is also assumed that the social problems evolve in ac...

متن کامل

A New Mathematical Approach based on Conic Quadratic Programming for the Stochastic Time-Cost Tradeoff Problem in Project Management

In this paper, we consider a stochastic Time-Cost Tradeoff Problem (TCTP) in PERT networks for project management, in which all activities are subjected to a linear cost function and assumed to be exponentially distributed. The aim of this problem is to maximize the project completion probability with a pre-known deadline to a predefined probability such that the required additional cost is min...

متن کامل

Bicriteria Resource Allocation Problem in Pert Networks

We develop a bicriteria model for the resource allocation problem in PERT networks, in which the total direct costs of the project as the first objective, and the mean of project completion time as the second objective are minimized. The activity durations are assumed to be independent random variables with either exponential or Erlang distributions, in which the mean of each activity duration ...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

عنوان ژورنال:
  • Computers & Mathematics with Applications

دوره 56  شماره 

صفحات  -

تاریخ انتشار 2008